Advances in discrete optimization
نویسندگان
چکیده
منابع مشابه
Recent Advances in Global Optimization for Combinatorial Discrete Problems
The optimization of discrete problems is largely encountered in engineering and information domains. Solving these problems with continuous-variables approach then convert the continuous variables to discrete ones does not guarantee the optimal global solution. Evolutionary Algorithms (EAs) have been applied successfully in combinatorial discrete optimization. Here, the mathematical basics of r...
متن کاملAdvances in Structural Optimization
1. SUMMARY The objective of this study is to investigate the efficiency of various Evolutionary Algorithms (EAs), such as Evolution Strategies (ESs) and Genetic Algorithms (GAs), when applied to large-scale sizing optimization problems. ESs and GAs imitate biological evolution in nature and combine the concept of artificial survival of the fittest with evolutionary operators to form a robust se...
متن کاملDISCRETE OPTIMIZATION in MSC
MSC.Nastran 2001 contains the ability to apply discrete variables in the optimization process. This was done in recognition that engineers are often required to deal with discrete variables in engineering design activities. MSC developed and implemented Design of Experiments (DOE) and Conservative Discrete Design (CDD) approaches to deal with discrete variables with limited computational cost. ...
متن کاملRecent Advances in Discrete and Discrete- Continuous Modeling Systems
This chapter discusses the importance of discrete choice and discrete-continuous modeling methods in the cost-benefit evaluation of transportation infrastructure improvement and other related projects. Specifically, discrete choice and discrete-continuous methods constitute the backbone of travel demand models that are used to predict travel characteristics and usage of transportation services ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2013
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2013.817072